Finding Small Administrative Lengths for Shortest Path Routing
نویسنده
چکیده
We study the problem of finding small integer arc lengths in a digraph such that some given paths are uniquely determined shortest paths. This Inverse Shortest Paths (ISP) problem arises in the planning of shortest path networks. We present an O(|V |)-approximation algorithm for ISP and show that minimizing the longest arc or the longest path length is APX -hard. Thus, deciding if a given path set can be realized with a real shortest path routing protocol such as OSPF, IS-IS, or RIP is NP-hard.
منابع مشابه
Hardness of Finding Small Shortest Path Routing Conflicts
Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...
متن کاملOn the Hardness of Finding Small Shortest Path Routing Conflicts
Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...
متن کاملRouting Planning As An Application Of Graph Theory
This paper presents a routing algorithm that uses fuzzy logic technique to find the shortest routing path. The basic idea behind path finding is searching a graph, starting at one point, and exploring adjacent nodes from there until the destination node is reached. Generally, the goal is of course to obtain the shortest route to the destination. The proposed Fuzzy Routing Algorithm (FRA) modifi...
متن کاملAsymptotic optimality of shortest path routing algorithms
Many communicat ion networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates is routed along a shortest path corresponding to the latest link lengths. We show that in certain situations, typical of networks involving a la...
متن کاملA generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
We generalize Dijkstra’s algorithm for finding shortest paths in digraphs with non-negative integral edge lengths. Instead of labeling individual vertices we label subgraphs which partition the given graph. We can achieve much better running times if the number of involved subgraphs is small compared to the order of the original graph and the shortest path problems restricted to these subgraphs...
متن کامل